Pruned Three-Dimensional Toroidal Networks

نویسندگان

  • Ding-Ming Kwai
  • Behrooz Parhami
چکیده

Using a unified framework, we show that a pruned 3D torus can be. explicitly specified by its pruning direction along which the links are uniformly removed from a complete 3D torus. The resulting networks, that offer the advantages of lower node degree and simpler layout, are inherently node-symmetric and maintain the same diameter as the original torus. It nuns out that the simplest pruning scheme is also best in preserving regularity, symmetry, and performance properties of the torus.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing Four Classes of Torus

The relative communication performance of low-versus high-dimensional torus networks (k-ary n-cubes) has been extensively studied under various assumptions about communication patterns and technological constraints. In this paper, we extend the comparison to torus networks with incomplete, but regular, connectivities. Taking an nD torus as the basis, we show that a simple pruning scheme can be ...

متن کامل

A Numerical Study of the Effect of Aspect Ratio on Heat Transfer in an Annular Flow Through a 270-Degree Curved Pipe.

In the present paper, a three dimensional annular developing incompressible laminar flow through 270- degree curved pipe is numerically simulated. The dimensionless governing equations of continuity, momentums and energy are driven in toroidal coordinates. The governing equations are discretized by projection algorithm using forward difference in time and central difference in space. A three-di...

متن کامل

Using Genetic Programming to Design Broadcasting Algorithms for Manhattan Street Networks

Broadcasting is the process of disseminating a message from a node of a communication network to all other nodes as quickly as possible. In this paper we consider Manhattan Street Networks (MSNs) which are mesh-structured, toroidal, directed, regular networks such that locally they resemble the geographical topology of the avenues and streets of Manhattan. With the use of genetic programming we...

متن کامل

Optimal Routing in Toroidal Networks

In this paper we study routing algorithms for one-to-one communication in multi-processors, whose interconnection networks have toroidal structure. A toroidal network is an n-dimensional rectangular mesh with additional edge-to-edge connections. Mathematically speaking, these networks are undirected graphs obtained by cartesian product of cycles. We show, that a broad class of routing algorithm...

متن کامل

Circuit-switched gossiping in the 3-dimensional torus networks

in this paper we describe, in the case of short messages, an efficient gossiping algorithm for 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuitswitched routing. The algorithm is based on a recursive decomposition of a torus. The algorithm requires an optimal number of rounds and a quasi-optimal number of intermediate switch settings to gossip in an 7i ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 68  شماره 

صفحات  -

تاریخ انتشار 1998